An Improved Binary Differential Evolution Algorithm to Infer Tumor Phylogenetic Trees

نویسندگان

  • Ying Liang
  • Bo Liao
  • Wen Zhu
چکیده

Tumourigenesis is a mutation accumulation process, which is likely to start with a mutated founder cell. The evolutionary nature of tumor development makes phylogenetic models suitable for inferring tumor evolution through genetic variation data. Copy number variation (CNV) is the major genetic marker of the genome with more genes, disease loci, and functional elements involved. Fluorescence in situ hybridization (FISH) accurately measures multiple gene copy number of hundreds of single cells. We propose an improved binary differential evolution algorithm, BDEP, to infer tumor phylogenetic tree based on FISH platform. The topology analysis of tumor progression tree shows that the pathway of tumor subcell expansion varies greatly during different stages of tumor formation. And the classification experiment shows that tree-based features are better than data-based features in distinguishing tumor. The constructed phylogenetic trees have great performance in characterizing tumor development process, which outperforms other similar algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Green Competitive Vehicle Routing Problem under Uncertainty Solved by an Improved Differential Evolution Algorithm

Regarding the development of distribution systems in the recent decades, fuel consumption of trucks has increased noticeably, which has a huge impact on greenhouse gas emissions. For this reason, the reduction of fuel consumption has been one of the most important research areas in the last decades. The aim of this paper is to propose a robust mathematical model for a variant of a vehicle routi...

متن کامل

P´olya Urn Models and Connections to Random Trees: A Review

This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...

متن کامل

Optimization of the Prismatic Core Sandwich Panel under Buckling Load and Yield Stress Constraints using an Improved Constrained Differential Evolution Algorithm

In this study, weight optimization of the prismatic core sandwich panel under transverse and longitudinal loadings has been independently investigated. To solve the optimization problems corresponding to the mentioned loadings, a new Improved Constrained Differential Evolution (ICDE) algorithm based on the multi-objective constraint handling method is implemented. The constraints of the problem...

متن کامل

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

متن کامل

Ant Algorithm for Construction of Evlutionary Tree

An evolutionary tree analyzes the nucleotide and amino acid sequencesis to infer phylogenetic relationships and evolutionary hypotheses. It is an unrooted binary tree. The sequence of the leaves are not given on the internal nodes. An evolutionary tree with n leaves has n − 2 internal nodes and m = 2n − 3 edges. The number of possible trees with n leaves is ∏n i−3 (2i− 5). Most version of evolu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 2017  شماره 

صفحات  -

تاریخ انتشار 2017